Degrees which do not bound minimal degrees
نویسنده
چکیده
The high/low hierarchy respects the ordering of degrees, and so we can expect to find properties of order which are possessed by all degrees in a given hierarchy class. Such properties can also be found for classes of the generalized high/low hierarchy even though that hierarchy does not respect the ordering of the degrees. For example, Jockusch and Posner [4], extending a result of Cooper [l], showed that no degree in m is minimal. By results of Yates [S] and Sasso [7], this result is best possible as both GL1 and GL,? GL1 contain minimal degrees. Jockusch [3] showed that there is a degree in GL3 GL2 which does not bound a minimal degree, and conjectured that such a result should be true for all proper classes of the generalized high/low hierarchy except for GH,. We prove Jockusch’s conjecture in Section 1, and extend the result to the high/low hierarchy in Section 2. We will be using the following notation and definitions (see [5] for more detail). ( @e : e E N) is a
منابع مشابه
Degrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملOn minimal degrees of faithful quasi-permutation representations of nilpotent groups
By a quasi-permutation matrix, we mean a square non-singular matrix over the complex field with non-negative integral trace....
متن کاملGroups with Two Extreme Character Degrees and their Minimal Faithful Representations
for a finite group G, we denote by p(G) the minimal degree of faithful permutation representations of G, and denote by c(G), the minimal degree of faithful representation of G by quasi-permutation matrices over the complex field C. In this paper we will assume that, G is a p-group of exponent p and class 2, where p is prime and cd(G) = {1, |G : Z(G)|^1/2}. Then we will s...
متن کاملBounding and nonbounding minimal pairs in the enumeration degrees
We show that every nonzero ∆ 2 e-degree bounds a minimal pair. On the other hand, there exist Σ 2 e-degrees which bound no minimal pair.
متن کاملA Generic Set That Does Not Bound a Minimal Pair
The structure of the semi lattice of enumeration degrees has been investigated from many aspects. One aspect is the bounding and nonbounding properties of generic degrees. Copestake proved that every 2-generic enumeration degree bounds a minimal pair and conjectured that there exists a 1-generic set that does not bound a minimal pair. In this paper we verify this longstanding conjecture by cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 30 شماره
صفحات -
تاریخ انتشار 1986